The Derived-Discrete Algebras Over the Real Numbers
نویسندگان
چکیده
We classify derived-discrete algebras over the real numbers up to Morita equivalence, using classification of complex in D. Vossieck, (J. Algebra, 243, 168–176 2001). To this end, we investigate quiver presentation complexified algebra a given by modulated and an admissible ideal.
منابع مشابه
On the diameter of the commuting graph of the full matrix ring over the real numbers
In a recent paper C. Miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{M}_n(mathbb{R})$ is equal to $4$ if either $n=3$ or $ngeq5$. But the case $n=4$ remained open, since the diameter could be $4$ or $5$. In this work we close the problem showing that also in this case the diameter is $4$.
متن کاملThe zero divisors of the Cayley–Dickson algebras over the real numbers
In this paper we describe algebraically the zero divisors of the Cayley Dickson algebras An = R n for n ≥ 4 over the real numbers. Introduction. The Cayley–Dickson algebra An over R is an algebra structure on R2n given inductively by the formulae: Let x = (x1, x2) and y = (y1, y2) in R n = R2 × R2 then xy = (x1y1 − y2x2, y2x1 + x2y1) where x = (x1,−x2). Therefore A0 = R,A1 = C complex numbers, ...
متن کاملon the diameter of the commuting graph of the full matrix ring over the real numbers
in a recent paper c. miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{m}_n(mathbb{r})$ is equal to $4$ if either $n=3$ or $ngeq5$. but the case $n=4$ remained open, since the diameter could be $4$ or $5$. in this work we close the problem showing that also in this case the diameter is $4$.
متن کاملNon deterministic computation over the real numbers
We have defended in [2, 3] the idea that the physical Church thesis, if it holds, explains the efficiency of mathematics to describe the laws of nature. And also that it suggests that the laws of nature can be expressed, not only in a language of propositions, but also in a language of algorithms. The arguments of Gandy [4], that support the physical Church thesis, even suggest that these algor...
متن کاملEffective Computation over the Real Numbers
We will obtain our simplest model, the ETM, by adding to Turing Machines the ability to add, multiply, and compare real numbers. We allow real parameters to appear in an ETM's program. In this manner the set of real numbers becomes the underlying domain of our computations much as a finite set of symbols is the domain of computation of a Turing machine. As successively deeper levels of GLB are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebras and Representation Theory
سال: 2022
ISSN: ['1386-923X', '1572-9079']
DOI: https://doi.org/10.1007/s10468-022-10127-4